The Path Hyperoperation

نویسندگان

  • Antonios Kalampakas
  • Stefanos Spartalis
  • Alexandros Tsigkas
چکیده

A new class of hypergroupoids, deriving from binary relations, is presented, via the introduced path hyperoperation. Its properties are investigated and its connections with Graph Theory are also delineated. Moreover, we present an application of this hyperoperation to assembly line designing and management.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some remarks on congruences obtained from the L-fuzzy Nakano hyperoperation

In this paper we study relations which are congruences with respect to ∧ and ⊔p, where ⊔pis the p-cut of the L-fuzzy hyperoperation ⊔. The main idea is to start from an equivalence relation R1 which is a congruence with respect to ∧ and ⊔1and, for each p ∈ X , construct an equivalence relation Rp which is a congruence with respect to ∧ and ⊔p. Furthermore, for each x ∈ Rp we construct a quotien...

متن کامل

Hv-groups defined on the same set

If a hyperoperation is weak associative then every greater hyperoperation, defined on the same set, is also weak associative. Using this property, the set of all Hv-groups with a scalar unit, defined on a set with three elements is determined.

متن کامل

Some Hypergroups Induced By Tree Automata

In this paper, we present some connections between tree automaton theory and hyperstructure theory. In this regard, at first we construct some hyperoperations on the set of trees and, specially, prove that one of them creates a join space. Also, we define a hyperoperation on the states of a tree automaton and, based on the properties of the tree automaton, we show that the proposed hyperoperati...

متن کامل

Enumeration of Rosenberg-type hypercompositional structures defined by binary relations

Every binary relation ρ on a set H, (card(H) > 1) can define a hypercomposition and thus endow H with a hypercompositional structure. In this paper the binary relations are represented by Boolean matrices. With their help, the hypercompositional structures (hypergroupoids, hypergroups, join hypergroups) that derive with the use of the Rosenberg’s hyperoperation, are characterized, constructed a...

متن کامل

n-ARY Hv-MODULES WITH EXTERNAL n-ARY P -HYPEROPERATION

Hyperstructure theory was born in 1934 when Marty [19] defined hypergroups as a generalization of groups. Let H be a non-empty set and let ℘∗(H) be the set of all non-empty subsets of H. A hyperoperation on H is a map ◦ : H ×H −→ ℘∗(H) and the couple (H, ◦) is called a hypergroupoid. If A and B are non-empty subsets of H, then we denote A◦B = ∪ a∈A, b∈B a◦b, x◦A = {x}◦A and A◦x = A◦{x}. Under c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014